import java.util.*;

/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 *   public TreeNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param root TreeNode类 
     * @param sum int整型 
     * @return int整型
     */

    private int cnt = 0;

    public void path(TreeNode node, int sum) {
        if (node == null)
            return ;
        
        if (sum == node.val) 
            cnt++;
        
        path(node.left, sum - node.val);
        path(node.right, sum - node.val);
    }

    public int FindPath (TreeNode root, int sum) {
        // write code here

        if (root == null) 
            return cnt;
        
        path(root, sum);

        FindPath(root.left, sum);
        FindPath(root.right, sum);

        return cnt;
    }
}